Crash Resilient and Pseudo-Stabilizing Atomic Registers
نویسندگان
چکیده
We propose a crash safe and pseudo-stabilizing algorithm for implementing an atomic memory abstraction in a message passing system. Our algorithm is particularly appealing for multi-core architectures where both processors and memory contents (including stale messages in transit) are prone to errors and faults. Our algorithm extends the classical fault-tolerant implementation of atomic memory that was originally proposed by Attiya, Bar-Noy, and Dolev (ABD) to a stabilizing setting where memory can be initially corrupted in an arbitrary manner. The original ABD algorithm provides no guaranties when started in such a corrupted configuration. Interestingly, our scheme preserves the same properties as ABD when there are no transient faults, namely the linearizability of operations. When started in an arbitrarily corrupted initial configuration, we still guarantee eventual yet suffix-closed linearizability.
منابع مشابه
Wait-Free Stabilizing Dining Using Regular Registers
Dining philosophers is a scheduling paradigm that determines when processes in a distributed system should execute certain sections of their code so that processes do not execute ‘conflicting’ code sections concurrently, for some application-dependent notion of a ‘conflict’. Designing a stabilizing dining algorithm for shared-memory systems subject to process crashes presents an interesting cha...
متن کاملSelf-Stabilizing implementation of atomic register by regular register in network framework
In shared-registers communication model for distribued systems, neighbouring processors communicate by reading or writing shared registers. Variants of shared communication register models occur in the literature. In this paper we study the variants where each processor owns a single-writer/multi-reader register. Each register is writable by this owner and readable by each neighbour of the owne...
متن کاملA characterization of colorless anonymous t-resilient task computability
A task is a distributed problem for n processes, in which each process starts with a private input value, communicates with other processes, and eventually decides an output value. A task is colorless if each process can adopt the input or output value of another process. Colorless tasks are well studied in the non-anonymous sharedmemory model where each process has a distinct identifier that c...
متن کاملHelp When Needed, But No More: Efficient Read/Write Partial Snapshot
An atomic snapshot object is an object that can be concurrently accessed by asynchronous processes prone to crash. It is made of m components (base atomic registers) and is defined by two operations: an update operation that allows a process to atomically assign a new value to a component and a snapshot operation that atomically reads and returns the values of all the components. To cope with t...
متن کاملFault-tolerant Implementations of regular Registers by safe Registers in Link Model
A network that uses locally shared registers can be modelled by a graph where nodes represent processors and there is an edge between two nodes if and only if the corresponding processors communicate directly by reading or writing registers shared between them. Two variants are defined by A variant of the model assumes that registers are singlewriter/single-reader and are located on the edges (...
متن کامل